/* LIBDGL -- a Directed Graph Library implementation
 * Copyright (C) 2002 Roberto Micarelli
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 */

/*
 * best view with tabstop=4
 */

#include <stdio.h>
#include <string.h>
#include <stdlib.h>


#include "type.h"
#include "tree.h"
#include "graph.h"
#include "graph_v1.h"
#include "helpers.h"


/* Template expansion
 */
#include "v1-defs.h"
#include "sp-template.c"
#include "nodemgmt-template.c"
#include "edgemgmt-template.c"
#include "misc-template.c"


/* algorithms for TREE state
 */
#define DGL_DEFINE_TREE_PROCS 1
#include "v1-defs.h"
#include "sp-template.c"
#include "span-template.c"
#undef DGL_DEFINE_TREE_PROCS


/* algorithms for FLAT state
*/
#define DGL_DEFINE_FLAT_PROCS 1
#include "v1-defs.h"
#include "sp-template.c"
#include "span-template.c"
#undef DGL_DEFINE_FLAT_PROCS



int dgl_dijkstra_V1	(
						dglGraph_s * 		pgraph ,
						dglSPReport_s **	ppReport ,
						dglInt32_t *			pDistance ,
						dglInt32_t 			nStart ,
						dglInt32_t 			nDestination ,
						dglSPClip_fn		fnClip,
						void * 				pvClipArg,
						dglSPCache_s * 	pCache
					)
{
	if ( pgraph->Flags & DGL_GS_FLAT ) {
		return dgl_dijkstra_V1_FLAT(pgraph,ppReport,pDistance,nStart,nDestination,fnClip,pvClipArg,pCache);
	}
	else {
		return dgl_dijkstra_V1_TREE(pgraph,ppReport,pDistance,nStart,nDestination,fnClip,pvClipArg,pCache);
	}
}


int dgl_depthfirst_spanning_V1(
						dglGraph_s * pgraphIn ,
						dglGraph_s * pgraphOut ,
						dglInt32_t nVertex ,
						void * pvVisited ,
						dglSpanClip_fn	fnClip ,
						void *				pvClipArg
						)
{
	if ( pgraphIn->Flags & DGL_GS_FLAT ) {
		return dgl_span_depthfirst_spanning_V1_FLAT(pgraphIn,pgraphOut,nVertex,pvVisited,fnClip,pvClipArg);
	}
	else {
		return dgl_span_depthfirst_spanning_V1_TREE(pgraphIn,pgraphOut,nVertex,pvVisited,fnClip,pvClipArg);
	}
}

int dgl_minimum_spanning_V1(
						dglGraph_s * pgraphIn ,
                        dglGraph_s * pgraphOut ,
						dglInt32_t nVertex ,
						dglSpanClip_fn	fnClip ,
						void *				pvClipArg
						)
{
	if ( pgraphIn->Flags & DGL_GS_FLAT ) {
		return dgl_span_minimum_spanning_V1_FLAT(pgraphIn,pgraphOut,nVertex,fnClip,pvClipArg);
	}
	else {
		return dgl_span_minimum_spanning_V1_TREE(pgraphIn,pgraphOut,nVertex,fnClip,pvClipArg);
	}
}


int dgl_initialize_V1( dglGraph_s * pgraph )
{
	if ( pgraph->pNodeTree == NULL ) pgraph->pNodeTree = avl_create( dglTreeNodeCompare, NULL, dglTreeGetAllocator() );
	if ( pgraph->pNodeTree == NULL ) {
		pgraph->iErrno = DGL_ERR_MemoryExhausted;
		return -pgraph->iErrno;
	}
	pgraph->pEdgeTree = NULL;
	return 0;
}

int dgl_release_V1( dglGraph_s * pgraph )
{
	pgraph->iErrno = 0;

	if ( pgraph->pNodeTree ) avl_destroy( pgraph->pNodeTree, dglTreeNodeCancel );
	if ( pgraph->pEdgeTree ) avl_destroy( pgraph->pEdgeTree, dglTreeEdgeCancel );
	if ( pgraph->pNodeBuffer ) free( pgraph->pNodeBuffer );
	if ( pgraph->pEdgeBuffer ) free( pgraph->pEdgeBuffer );
	if ( pgraph->edgePrioritizer.pvAVL ) avl_destroy( pgraph->edgePrioritizer.pvAVL, dglTreeEdgePri32Cancel );
	if ( pgraph->nodePrioritizer.pvAVL ) avl_destroy( pgraph->nodePrioritizer.pvAVL, dglTreeNodePri32Cancel );

	return 0;
}


int dgl_write_V1( dglGraph_s * pgraph , FILE *fd )
{
	long nret , cnt , tot;	

	pgraph->iErrno = 0;

	if ( fwrite( & pgraph->Version , 1 , 1 , fd ) != 1 )
	{
		pgraph->iErrno = DGL_ERR_Write;
		return -pgraph->iErrno;
	}

	if ( fwrite( & pgraph->Endian , 1 , 1, fd) != 1 )
	{
		pgraph->iErrno = DGL_ERR_Write;
		return -pgraph->iErrno;
	}

	if ( fwrite( & pgraph->NodeAttrSize  , sizeof( dglInt32_t ) ,1, fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Write;
		return -pgraph->iErrno;
	}

	if ( fwrite( & pgraph->EdgeAttrSize  , sizeof( dglInt32_t ) ,1, fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Write;
		return -pgraph->iErrno;
	}

	for ( cnt = 0 ; cnt < 16 ; cnt ++ )
	{
		if ( fwrite( & pgraph->aOpaqueSet[ cnt ] , sizeof( dglInt32_t ) ,1, fd) != 1)
		{
			pgraph->iErrno = DGL_ERR_Write;
			return -pgraph->iErrno;
		}
	}

	if ( fwrite( & pgraph->nnCost , sizeof( dglInt64_t ),1, fd ) != 1)
	{
		pgraph->iErrno = DGL_ERR_Write;
		return -pgraph->iErrno;
	}

	if ( fwrite( & pgraph->cNode , sizeof( dglInt32_t ) ,1, fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Write;
		return -pgraph->iErrno;
	}

	if ( fwrite( & pgraph->cHead , sizeof( dglInt32_t ) ,1, fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Write;
		return -pgraph->iErrno;
	}

	if ( fwrite( & pgraph->cTail , sizeof( dglInt32_t ) ,1, fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Write;
		return -pgraph->iErrno;
	}

	if ( fwrite( & pgraph->cAlone , sizeof( dglInt32_t ) ,1, fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Write;
		return -pgraph->iErrno;
	}

	if ( fwrite( & pgraph->cEdge , sizeof( dglInt32_t ) ,1, fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Write;
		return -pgraph->iErrno;
	}

	if ( fwrite( & pgraph->iNodeBuffer , sizeof( dglInt32_t ) ,1, fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Write;
		return -pgraph->iErrno;
	}

	if ( fwrite( & pgraph->iEdgeBuffer , sizeof( dglInt32_t ) ,1, fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Write;
		return -pgraph->iErrno;
	}

	for( tot = 0 , cnt = pgraph->iNodeBuffer ; tot < cnt ; tot += nret )
	{
		if ( (nret = fwrite( & pgraph->pNodeBuffer[ tot ] , 1, cnt - tot , fd)) <= 0 )
		{
			pgraph->iErrno = DGL_ERR_Write;
			return -pgraph->iErrno;
		}
	}

	for( tot = 0 , cnt = pgraph->iEdgeBuffer ; tot < cnt ; tot += nret )
	{
		if ( (nret = fwrite( & pgraph->pEdgeBuffer[ tot ] , 1, cnt - tot , fd)) <= 0 )
		{
			pgraph->iErrno = DGL_ERR_Write;
			return -pgraph->iErrno;
		}
	}

	return 0;
}


int dgl_read_V1( dglGraph_s * pgraph , FILE *fd )
{
	long 		nret , cnt , tot;	
	dglByte_t 	Endian;
	dglInt32_t	NodeAttrSize , EdgeAttrSize;
	int			i, cn, fSwap;
	dglInt32_t *	pn;

	if ( fread( & Endian , 1 , 1 , fd) != 1 )
	{
		pgraph->iErrno = DGL_ERR_Read;
		return -pgraph->iErrno;
	}

	fSwap = 0;
#ifdef DGL_ENDIAN_BIG
	if ( Endian == DGL_ENDIAN_LITTLE ) fSwap = 1;
#else
	if ( Endian == DGL_ENDIAN_BIG    ) fSwap = 1;
#endif

	if ( fread( & NodeAttrSize , sizeof( dglInt32_t ) , 1 , fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Read;
		return -pgraph->iErrno;
	}
	if ( fSwap ) dgl_swapInt32Bytes( & NodeAttrSize );

	if ( fread( & EdgeAttrSize , sizeof( dglInt32_t ) , 1 , fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Read;
		return -pgraph->iErrno;
	}
	if ( fSwap ) dgl_swapInt32Bytes( & EdgeAttrSize );

	if ( (nret = dglInitialize( pgraph, 1, NodeAttrSize, EdgeAttrSize, NULL )) < 0 )
	{
		return nret;
	}

	for ( cnt = 0 ; cnt < 16 ; cnt ++ )
	{
		if ( (nret=fread( & pgraph->aOpaqueSet[ cnt ] , sizeof( dglInt32_t ) , 1 , fd)) != 1)
		{
			pgraph->iErrno = DGL_ERR_Read;
			return -pgraph->iErrno;
		}
		if ( fSwap ) dgl_swapInt32Bytes( & pgraph->aOpaqueSet[ cnt ] );
	}

	if ( fread( & pgraph->nnCost , sizeof( dglInt64_t ) , 1 , fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Read;
		return -pgraph->iErrno;
	}
	if ( fSwap ) dgl_swapInt64Bytes( & pgraph->nnCost );

	if ( fread( & pgraph->cNode , sizeof( dglInt32_t ) , 1 , fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Read;
		return -pgraph->iErrno;
	}
	if ( fSwap ) dgl_swapInt32Bytes( & pgraph->cNode );

	if ( fread( & pgraph->cHead , sizeof( dglInt32_t ) , 1 , fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Read;
		return -pgraph->iErrno;
	}
	if ( fSwap ) dgl_swapInt32Bytes( & pgraph->cHead );

	if ( fread( & pgraph->cTail , sizeof( dglInt32_t ) , 1 , fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Read;
		return -pgraph->iErrno;
	}
	if ( fSwap ) dgl_swapInt32Bytes( & pgraph->cTail );

	if ( fread( & pgraph->cAlone , sizeof( dglInt32_t ) , 1 , fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Read;
		return -pgraph->iErrno;
	}
	if ( fSwap ) dgl_swapInt32Bytes( & pgraph->cAlone );

	if ( fread( & pgraph->cEdge , sizeof( dglInt32_t ) , 1 , fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Read;
		return -pgraph->iErrno;
	}
	if ( fSwap ) dgl_swapInt32Bytes( & pgraph->cEdge );

	if ( fread( & pgraph->iNodeBuffer , sizeof( dglInt32_t ) , 1 , fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Read;
		return -pgraph->iErrno;
	}
	if ( fSwap ) dgl_swapInt32Bytes( & pgraph->iNodeBuffer );

	if ( fread( & pgraph->iEdgeBuffer , sizeof( dglInt32_t ) , 1 , fd) != 1)
	{
		pgraph->iErrno = DGL_ERR_Read;
		return -pgraph->iErrno;
	}
	if ( fSwap ) dgl_swapInt32Bytes( & pgraph->iEdgeBuffer );

	if ( (pgraph->pNodeBuffer = malloc( pgraph->iNodeBuffer )) == NULL )
	{
		pgraph->iErrno = DGL_ERR_MemoryExhausted;
		return -pgraph->iErrno;
	}

	if ( (pgraph->pEdgeBuffer = malloc( pgraph->iEdgeBuffer )) == NULL )
	{
		free( pgraph->pNodeBuffer );
		pgraph->iErrno = DGL_ERR_MemoryExhausted;
		return -pgraph->iErrno;
	}

	for( tot = 0 , cnt = pgraph->iNodeBuffer ; tot < cnt ; tot += nret )
	{
		if ( (nret = fread( & pgraph->pNodeBuffer[ tot ] , 1, cnt - tot , fd)) <= 0 )
		{
			free( pgraph->pNodeBuffer );
			free( pgraph->pEdgeBuffer );
			pgraph->iErrno = DGL_ERR_Read;
			return -pgraph->iErrno;
		}
	}
	if ( fSwap ) {
		pn = (dglInt32_t*) pgraph->pNodeBuffer;
		cn = pgraph->iNodeBuffer / sizeof(dglInt32_t);
		for ( i = 0 ; i < cn ; i ++ ) {
			dgl_swapInt32Bytes( & pn[i] );
		}
	}

	for( tot = 0 , cnt = pgraph->iEdgeBuffer ; tot < cnt ; tot += nret )
	{
		if ( (nret = fread( & pgraph->pEdgeBuffer[ tot ] , 1, cnt - tot , fd)) <= 0 )
		{
			free( pgraph->pNodeBuffer );
			free( pgraph->pEdgeBuffer );
			pgraph->iErrno = DGL_ERR_Read;
			return -pgraph->iErrno;
		}
	}
	if ( fSwap ) {
		pn = (dglInt32_t*) pgraph->pEdgeBuffer;
		cn = pgraph->iEdgeBuffer / sizeof(dglInt32_t);
		for ( i = 0 ; i < cn ; i ++ ) {
			dgl_swapInt32Bytes( & pn[i] );
		}
	}

	pgraph->Flags |= 0x1; /* flat-state */
	return 0;
}
